Supporting Ranked Boolean Similarity Queries in MARS

نویسندگان

  • Michael Ortega-Binderberger
  • Yong Rui
  • Kaushik Chakrabarti
  • Kriengkrai Porkaew
  • Sharad Mehrotra
  • Thomas S. Huang
چکیده

To address the emerging needs of applications that require access to and retrieval of multimedia objects we are developing the Multimedia Analysis and Retrieval System MARS in our group at the University of Illinois In this paper we concentrate on the retrieval subsystem of MARS and its support for content based queries over image databases Content based retrieval techniques have been extensively studied for textual documents in the area of automatic information retrieval This paper describes how these techniques can be adapted for ranked retrieval over image databases Speci cally we discuss the ranking and retrieval algorithms developed in MARS based on the Boolean retrieval model and describe the results of our experiments that demonstrate the e ectiveness of the developed model for image retrieval

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Supporting Ranked Boolean Similarity Queries in MARS - Knowledge and Data Engineering, IEEE Transactions on

To address the emerging needs of applications that require access to and retrieval of multimedia objects, we are developing the Multimedia Analysis and Retrieval System (MARS) [29]. In this paper, we concentrate on the retrieval sulbsystem of MARS and its support for content-based queries over image databases. Content-based retrieval techniques have been extensively studied for textual document...

متن کامل

Precision and Recall of RankingInformation - Filtering

An information-ltering system collects incoming data of speciic interests described in a server proole. These systems can export their collections by submitting their prooles to a directory server, where users can query for relevant systems to answer their requests. We develop a new similarity measure to rank information-ltering systems for Boolean queries. Users can send queries to the top-ran...

متن کامل

Term-Frequency Surrogates in Text Similarity Computations

Inverted indexes on external storage perform best when accesses are ordered and data is read sequentially, so that seek times are minimized. As a consequence, the various items required to compute Boolean, ranked and phrase queries are often interleaved in the inverted lists. While suitable for query types in which all items are required, this arrangement has the drawback that other query types...

متن کامل

When Stopping Rules Don’t Stop

Performing ranked retrieval on large document collections can be slow. The method of stopping rules has been proposed to make it more efficient. Stopping rules, which terminate search when the highest ranked documents have been determined to some degree of likelihood, are attractive and have proven useful in clustering, but have not worked well in retrieval experiments. This paper presents a st...

متن کامل

Similarity-based Queries for XML Databases Using ELIXIR

Existing XML query languages do not support ranked query results based on textual similarity. For example, Fig. 1 shows an XML database containing books and CDs. We are interested in information-retrieval-style queries such as “order the items by similarity to the phrase ‘traditional Ukrainian”’ or “find books and CDs with similar titles. Unlike similar efforts, our expressive and efficient lan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Knowl. Data Eng.

دوره 10  شماره 

صفحات  -

تاریخ انتشار 1998